Bounding Volume Construction using Point Clouds
نویسنده
چکیده
Bounding volumes are used to optimize many graphic algorithms. They permit to decide quickly if a more exact test is likely to succeed or not. The exact test is only applied if the bounding volume test succeeds, which saves time in most cases. Two of the most prominent applications are ray tracing and collision detection. This paper presents a new method to calculate tight bounding volumes for primitives under arbitrary transformations and hierarchical scene descriptions. An optimized form of storing a convex hull is presented which allows efficient calculation of the bounding volume type used for later processing. Results are shown for the ray tracing of cyclic CSG-graphs used to render plants and other natural phenomena.
منابع مشابه
Proximity Computations between Noisy Point Clouds using Robust Classification
We present a new approach to perform robust proximity queries between noisy point cloud data. Our approach takes into account the uncertainty that arises due to discretization error and noise, and formulates contact computation as a twoclass classification problem. We use appropriate techniques from machine learning to compute the collision probability for each point in the input data and accel...
متن کاملProbabilistic Collision Detection Between Noisy Point Clouds Using Robust Classification
We present a new collision detection algorithm to perform contact computations between noisy point cloud data. Our approach takes into account the uncertainty that arises due to discretization error and noise, and formulates collision checking as a two-class classification problem. We use techniques from machine learning to compute the collision probability for each point in the input data and ...
متن کاملAnalysis of Point Clouds - Using Conformal Geometric Algebra
This paper presents some basics for the analysis of point clouds using the geometrically intuitive mathematical framework of conformal geometric algebra. In this framework it is easy to compute with osculating circles for the description of local curvature. Also methods for the fitting of spheres as well as bounding spheres are presented. In a nutshell, this paper provides a starting point for ...
متن کاملMassively-Parallel Proximity Queries for Point Clouds
We present a novel massively-parallel algorithm that allows real-time distance computations between arbitrary 3D objects and unstructured point cloud data. Our main application scenario is collision avoidance for robots in highly dynamic environments that are recorded via a Kinect, but our algorithm can be easily generalized for other applications such as virtual reality. Basically, we represen...
متن کاملAn Efficient Collision Detection Algorithm for Point Cloud Models
Point clouds models are a common shape representation for several reasons. Three-dimensional scanning devices are widely used nowadays and points are an attractive primitive for rendering complex geometry. Nevertheless, there is not much literature on collision detection for point cloud models. This paper presents a novel collision detection algorithm for point cloud models. The scene graph is ...
متن کامل